Computable stack functions for semantics of stack programs
نویسندگان
چکیده
منابع مشابه
A Tail-Recursive Semantics for Stack Inspections
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization pol icy. An implementation of such a language may have to allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory-allocating construct) may nevertheless exhaust the avail able memory. In this paper, we prove this wid...
متن کاملStack Size Analysis for Interrupt-Driven Programs
We study the problem of determining stack boundedness and the exact maximum stack size for three classes of interrupt-driven programs. Interrupt-driven programs are used in many real-time applications that require responsive interrupt handling. In order to ensure responsiveness, programmers often enable interrupt processing in the body of lower-priority interrupt handlers. In such programs a pr...
متن کاملOptimizing the stack size of recursive functions
For memory constrained environments, optimization for program size is often as important as, if not more important than, optimization for execution speed. Commonly, compilers try to reduce the code segment but neglect the stack segment, although the stack can significantly grow during the execution of recursive functions because a separate activation record is required for each recursive call. ...
متن کاملGeneralizing Cook's Transformation to Imperative Stack Programs
Cook’s construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and the more general [5] describes analogous results for other abstract machines. The goal of this paper is to make Cook’s result usable for a broader spectrum of practical problems. We introduce a family of one-stack program...
متن کاملAnalyzing Stack Flows to Compare Java Programs
SUMMARY This paper presents a method for comparing and detecting clones of Java programs by analyzing program stack flows. A stack flow denotes an operational behavior of a program by describing individual instructions and stack movements for performing specific operations. We analyze stack flows by simulating the operand stack movements during execution of a Java program. Two programs for dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1979
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90024-2